ha l - 00 13 58 11 , v er si on 1 - 8 M ar 2 00 7 Sofic trace subshift of a cellular automaton ⋆
نویسندگان
چکیده
The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram. In this paper we study conditions for a sofic subshift to be the trace of a cellular automaton.
منابع مشابه
ar X iv : m at h . D S / 07 03 24 1 v 1 8 M ar 2 00 7 Sofic trace subshift of a cellular
The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram. In this paper we study conditions for a sofic subshift to be the trace of a cellular automaton.
متن کاملha l - 00 16 46 73 , v er si on 1 - 2 8 M ar 2 00 8 Neutral Fitness Landscape in the Cellular Automata Majority Problem
We study in detail the fitness landscape of a difficult cellular automata computational task: the majority problem. Our results show why this problem landscape is so hard to search, and we quantify the large degree of neutrality found in various ways. We show that a particular subspace of the solution space, called the ”Olympus”, is where good solutions concentrate, and give measures to quantit...
متن کاملSofic Trace of a Cellular Automaton
The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram. In this paper we study conditions for a sofic subshift to be the trace of a cellular automaton.
متن کاملin ri a - 00 00 11 64 , v er si on 1 - 2 4 M ar 2 00 6 A unifying framework for seed sensitivity and its application to subset seeds ( Extended abstract )
We propose a general approach to compute the seed sensitivity, that can be applied to different definitions of seeds. It treats separately three components of the seed sensitivity problem – a set of target alignments, an associated probability distribution, and a seed model – that are specified by distinct finite automata. The approach is then applied to a new concept of subset seeds for which ...
متن کاملSpectral Domain Boundaries in Cellular Automata
Let AZD be the Cantor space of Z-indexed configurations in a finite alphabet A, and let σ be the Z-action of shifts on AZD . A cellular automaton is a continuous, σ-commuting self-map Φ of AZD , and a Φ-invariant subshift is a closed, (Φ, σ)-invariant subset A ⊂ AZD . Suppose a ∈ AZD is A-admissible everywhere except for some small region we call a defect. It has been empirically observed that ...
متن کامل